Needles in a Haystack: Plan Recognition in Large Spatial Domains Involving Multiple Agents

نویسندگان

  • Mark Devaney
  • Ashwin Ram
چکیده

While plan recognition research has been applied to a wide variety of problems, it has largely made identical assumptions about the number of agents participating in the plan, the observability of the plan execution process, and the scale of the domain. We describe a method for plan recognition in a real-world domain involving large numbers of agents performing spatial maneuvers in concert under conditions of limited observability. These assumptions differ radically from those traditionally made in plan recognition and produce a problem which combines aspects of the fields of plan recognition, pattern recognition, and object tracking. We describe our initial solution which borrows and builds upon research from each of these areas, employing a pattern-directed approach to recognize individual movements and generalizing these to produce inferences of large-scale behavior.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Single-Agent to Multi-Agent: Challenges for Plan Recognition Systems

The ability of recognizing a multi-agent plan a plan which has been generated for multiple executing agents implies the skill of recognizing the plan underlying a collective activity in which a group of agents is involved. Multi-agent plan recognition is a necessary and useful extension of current PR systems in some domains. In this work starting from CHAPLIN (CHart Applied to PLan INference, a...

متن کامل

On the Recognition of Abstract Markov Policies

Abstraction plays an essential role in the way the agents plan their behaviours, especially to reduce the computational complexity of planning in large domains. However, the effects of abstraction in the inverse process – plan recognition – are unclear. In this paper, we present a method for recognising the agent’s behaviour in noisy and uncertain domains, and across multiple levels of abstract...

متن کامل

Plan Recognition in Complex Spatial Domains

We are researching the problem of plan recognition in a complex real-world domain consisting of training battles conducted by actual troops at the US Army’s National Training Center. These battles involve hundreds of participants, last several days, and take place over a very large geographical area. Our task is to identify from this data repeated patterns of movement which correspond to planne...

متن کامل

Aligning Needles in a Haystack: Paraphrase Acquisition Across the Web

This paper presents a lightweight method for unsupervised extraction of paraphrases from arbitrary textual Web documents. The method differs from previous approaches to paraphrase acquisition in that 1) it removes the assumptions on the quality of the input data, by using inherently noisy, unreliable Web documents rather than clean, trustworthy, properly formatted documents; and 2) it does not ...

متن کامل

The Needles-in-Haystack Problem

We consider a new data mining problem of detecting the members of a rare class of data, the needles, that have been hidden in a set of records, the haystack. Besides the haystack, a single instance of a needle is given. It is assumed that members of the needle class are similar according to an unknown needle characterization. The goal is to find the needle records hidden in the haystack. This p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998